Extracting a data flow analyser in constructive logic
نویسندگان
چکیده
منابع مشابه
Extracting a Data Flow Analyser in Constructive Logic
A constraint-based data flow analysis is formalised in the specification language of the Coq proof assistant. This involves defining a dependent type of lattices together with a library of lattice functors for modular construction of complex abstract domains. Constraints are represented in a way that allows for both efficient constraint resolution and correctness proof of the analysis with resp...
متن کاملExtracting Constructive Content from Classical Logic via Control-like Reductions
Recently there has been much interest in the problem of nding the computational content of classical reasoning. One of the most appealing directions for the computer scientist to tackle such a problem is the relation which has been established between classical logic and lambda calculi with control operators, like Felleisen's control operator C. In this paper we introduce a typed lambda calculu...
متن کاملNegation in Logic Programming: A Formalization in Constructive Logic
The conventional formalization of logic programming in classical logic explains very convincingly the basic principles of this programming style. However, it gives no easy or intuitive explanations for the treatment of negation. Logic Programming handles negation through the so-called ^Negation as Failure" inference principle which is rather unconventional from the viewpoint of classical logic....
متن کاملMathematical Logic : Constructive a N D Non - Constructive Operations
Early in the century, especially in connection with Hubert 's treatment of geometry (1899), it was being said tha t the theorems of an axiomatic theory express truths about whatever systems of objects make the axioms true. In the simplest case, a system S consists of a non-empty set D (the domain), in which there are distinguished certain individuals, and over which there are defined certain %-...
متن کاملConstructive interpolation in hybrid logic
Craig’s interpolation lemma (if φ → ψ is valid, then φ → θ and θ → ψ are valid, for θ a formula constructed using only primitive symbols which occur both in φ and ψ) fails for many propositional and first order modal logics. The interpolation property is often regarded as a sign of well-matched syntax and semantics. Hybrid logicians claim that modal logic is missing important syntactic machiner...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.06.004